Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets
نویسندگان
چکیده
منابع مشابه
The Maximum Number of Maximal Independent Sets in Forests
Let G be a simple and undirected graph. By mi(G) we denote the number of maximal independent sets in G. In this note, we determine the maximum number of maximal independent sets among the set of a type of forests. Mathematics Subject Classification: 05C05; 05C50; 05C69
متن کاملIntegers for the Number of Maximal Independent Sets in Graphs
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. In this paper we determine the third and fouth largest value of mi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
متن کاملOn the number of maximal independent sets in a graph
Let G be a (simple, undirected, finite) graph. A set S ⊆ V (G) is independent if no edge of G has both its endpoints in S. An independent set S is maximal if no independent set of G properly contains S. Let MIS(G) be the set of all maximal independent sets in G. Miller and Muller (1960) and Moon and Moser (1965) independently proved that the maximum, taken over all n-vertex graphs G, of |MIS(G)...
متن کاملGraphs with the second largest number of maximal independent sets
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. Erdős and Moser raised the problem of determining the maximum value of mi(G) among all graphs of order n and the extremal graphs achieving this maximum value. This problem was solved by Moon and Moser. Then it was studied for many special classes of grap...
متن کاملInverse problems for the number of maximal independent sets
We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number n of maximal independent sets for a class of natural numbers that can be represented as concatenation of periodic binary words. Problems of estimating variou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2002
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v9i45.21760